An iterative procedure for extracting skill maps from data
نویسندگان
چکیده
منابع مشابه
Extracting Road Vector Data from Raster Maps
Raster maps are an important source of road information. Because of the overlapping map features (e.g., roads and text labels) and the varying image quality, extracting road vector data from raster maps usually requires significant user input to achieve accurate results. In this paper, we present an accurate road vectorization technique that minimizes user input by combining our previous work o...
متن کاملExtracting Skeletons from Distance Maps
A skeleton is a useful shape descriptor that encodes both boundary and region information for a given object. A widely used approach for skeletonization is to use a distance transform. Although many skeletonization algorithms have been developed, most methods involve the computation of high order derivatives and the evaluation of complex expressions. In this paper, we propose an algorithm that ...
متن کاملExtracting Features from Tactile Maps
Tactile imaging is a newly developed mechanical sensing technology for documenting the properties of hard lumps contained in soft tissue. An examiner strokes a scan head across tissue that contains a mass and images of the distributed contact pressure between the head and the tissue are recorded. We have developed models that predict these pressure distributions from geometric and material prop...
متن کاملAn Iterative Improvement Procedure for Hierarchical Clustering
We describe a procedure which finds a hierarchical clustering by hillclimbing. The cost function we use is a hierarchical extension of the k-means cost; our local moves are tree restructurings and node reorderings. We show these can be accomplished efficiently, by exploiting special properties of squared Euclidean distances and by using techniques from scheduling and VLSI algorithms.
متن کاملAn Iterative Procedure for Evaluating Digraph Competitions
A competition which is based on the results of (partial) pairwise comparisons can be modelled by means of a directed graph. Given initial weights on the nodes in such digraph competitions, we view the measurement of the importance (i.e., the cardinal ranking) of the nodes as an allocation problem where we redistribute the initial weights on the basis of insights from cooperative game theory. Af...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Behavior Research Methods
سال: 2015
ISSN: 1554-3528
DOI: 10.3758/s13428-015-0609-9